stochastic approach to vehicle routing problem: development and theories

stochastic approach to vehicle routing problem: development and theories abstract in this article, a chance constrained (ccp) formulation of the vehicle routing problem (vrp) is proposed. the reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. knowing that reliable computer software for large scaled complex nonlinear programming problem with 0-1 type decision variables for stochastic vehicle routing problem (svrp) is not easily available merely then the value of an approximation technique becomes imperative. in this article, theorems which build a foundation for moving toward the development of an approximate methodology for solving svrp are stated and proved. key words: vehicle routing problem, chance constrained programming, linear approximation, optimization.